Uniform Kazhdan Constant for {SLn(Z)}n≥3

نویسنده

  • Uzy Hadad
چکیده

Let R be a ring generated by l elements with stable range r. Assume that the group EL d (R) has Kazhdan constant ǫ 0 > 0 for some d ≥ r + 1. We prove that there exist ǫ(ǫ 0 , l) > 0 and k ∈ N, s.t. for every n ≥ d, EL n (R) has a generating set of order k and a Kazhdan constant larger than ǫ. As a consequence, we obtain for SL n (Z) where n ≥ 3, a Kazhdan constant which is independent of n w.r.t generating set of a fixed size.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniform Kazhdan Constant for some families of linear groups

Let R be a ring generated by l elements with stable range r. Assume that the group ELd(R) has Kazhdan constant ǫ0 > 0 for some d ≥ r + 1. We prove that there exist ǫ(ǫ0, l) > 0 and k ∈ N, s.t. for every n ≥ d, ELn(R) has a generating set of order k and a Kazhdan constant larger than ǫ. As a consequence, we obtain for SLn(Z) where n ≥ 3, a Kazhdan constant which is independent of n w.r.t generat...

متن کامل

Kazhdan Constants for Sln(Z)

In this article we improve the known Kazhdan constant for SLn(Z) with respect to the generating set of the elementary matrices. We prove that the Kazhdan constant is bounded from below by [42 √ n + 860], which gives the exact asymptotic behavior of the Kazhdan constant, as n goes to infinity, since √ 2/n is an upper bound. We can use this bound to improve the bounds for the spectral gap of the ...

متن کامل

Uniform Pointwise Bounds for Matrix Coefficients of Unitary Representations and Applications to Kazhdan Constants

Let k be a local field of characteristic not 2, and let G be the group of k-rational points of a connected reductive linear algebraic group defined over k with a simple derived group of k-rank at least 2. We construct new uniform pointwise bounds for the matrix coefficients of all infinite-dimensional irreducible unitary representations of G. These bounds turn out to be optimal for SLn(k), n ≥ ...

متن کامل

Navigating in the Cayley graphs of SLN(Z) and SLN(Fp)

We give a non-deterministic algorithm that expresses elements of SLN (Z), for N ≥ 3, as words in a finite set of generators, with the length of these words at most a constant times the word metric. We show that the non-deterministic time-complexity of the subtractive version of Euclid’s algorithm for finding the greatest common divisor of N ≥ 3 integers a1, . . . , aN is at most a constant time...

متن کامل

Diameters of Cayley Graphs

We show that for integers k ≥ 2 and n ≥ 3, the diameter of the Cayley graph of SLn(Z/kZ) associated to a standard two-element generating set, is at most a constant times n 2 ln k. This answers a question of A. Lubotzky concerning SLn(Fp) and is unexpected because these Cayley graphs do not form an expander family. Our proof amounts to a quick algorithm for finding short words representing eleme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008